github.com/andybalholm/brotli.histogramDistance.data_ (field)

23 uses

	github.com/andybalholm/brotli (current package)
		bit_cost.go#L318: 		if histogram.data_[i] > 0 {
		bit_cost.go#L336: 		var histo0 uint32 = histogram.data_[s[0]]
		bit_cost.go#L337: 		var histo1 uint32 = histogram.data_[s[1]]
		bit_cost.go#L338: 		var histo2 uint32 = histogram.data_[s[2]]
		bit_cost.go#L348: 			histo[i] = histogram.data_[s[i]]
		bit_cost.go#L376: 			if histogram.data_[i] > 0 {
		bit_cost.go#L377: 				var log2p float64 = log2total - fastLog2(uint(histogram.data_[i]))
		bit_cost.go#L383: 				bits += float64(histogram.data_[i]) * log2p
		bit_cost.go#L401: 				for k = i + 1; k < data_size && histogram.data_[k] == 0; k++ {
		block_splitter_distance.go#L82: 			insert_cost[i*num_histograms+j] = insert_cost[j] - bitCost(uint(histograms[j].data_[i]))
		brotli_bit_stream.go#L1264: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)
		brotli_bit_stream.go#L1437: 	buildAndStoreHuffmanTree(dist_histo.data_[:], maxSimpleDistanceAlphabetSize, uint(num_distance_symbols), tree, dist_depth[:], dist_bits[:], storage_ix, storage)
		brotli_bit_stream.go#L1496: 		buildAndStoreHuffmanTreeFast(dist_histo.data_[:], dist_histo.total_count_, /* max_bits = */
		histogram.go#L107: 	data_        [numDistanceSymbols]uint32
		histogram.go#L113: 	self.data_ = [numDistanceSymbols]uint32{}
		histogram.go#L126: 	self.data_[val]++
		histogram.go#L138: 		self.data_[p[0]]++
		histogram.go#L147: 		self.data_[i] += v.data_[i]
		metablock.go#L572: 		optimizeHuffmanCountsForRLE(uint(num_distance_codes), mb.distance_histograms[i].data_[:], good_for_rle[:])
		metablock_distance.go#L75: 		last_entropy[0] = bitsEntropy(histograms[0].data_[:], self.alphabet_size_)
		metablock_distance.go#L85: 		var entropy float64 = bitsEntropy(histograms[self.curr_histogram_ix_].data_[:], self.alphabet_size_)
		metablock_distance.go#L94: 			combined_entropy[j] = bitsEntropy(combined_histo[j].data_[0:], self.alphabet_size_)